Generalized 3-Connectivity of Alternating Group Networks
نویسندگان
چکیده
منابع مشابه
Toughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملtoughness of the networks with maximum connectivity
the stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. as the network begins losing links or nodes, eventually there is a loss in its effectiveness. thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملOn generalized atom-bond connectivity index of cacti
The generalized atom-bond connectivity index of a graph G is denoted by ABCa(G) and defined as the sum of weights ((d(u)+d(v)-2)/d(u)d(v))aa$ over all edges uv∊G. A cactus is a graph in which any two cycles have at most one common vertex. In this paper, we compute sharp bounds for ABCa index for cacti of order $n$ ...
متن کاملConnectivity and generalized cliques in sociometric group structure.
By using the concepts of ant imetry and n-chain it is possible to define and to investigate some properties of connectivity in a sociometric group. I t is shown tha t tbe number of elements in a group, the number of antimetries, and the degree of connectivity must satisfy certain inequalities. Using the ideas of connectivity, a generalized concept of clique, called an n-clique, is introduced. n...
متن کاملThe generalized connectivity of complete equipartition 3-partite graphs
Let G be a nontrivial connected graph of order n, and k an integer with 2 ≤ k ≤ n. For a set S of k vertices of G, let κ(S) denote the maximum number ` of edge-disjoint trees T1, T2, . . . , T` in G such that V (Ti) ∩ V (Tj) = S for every pair of distinct integers i, j with 1 ≤ i, j ≤ `. Chartrand et al. generalized the concept of connectivity as follows: The kconnectivity of G, denoted by κk(G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/cnsce2017/8899